On Linial's conjecture for spine digraphs
نویسندگان
چکیده
In this paper we introduce a superclass of split digraphs, which we call spine digraphs. Those are the digraphs D whose vertex set can be partitioned into two sets X and Y such that the subdigraph induced by X is traceable and Y is a stable set. We also show that Linial’s Conjecture holds for spine digraphs.
منابع مشابه
A New Proof of Berge’s Strong Path Partition Conjecture for Acyclic Digraphs
Berge’s elegant strong path partition conjecture from 1982 extends the Greene-Kleitman Theorem and Dilworth’s Theorem for all digraphs. The conjecture is known to be true for all digraphs for k = 1 by the Gallai-Milgram Theorem, and for k > 1 only for acyclic digraphs. We present a simple algorithmic proof for k = 1 which naturally extends to a new algorithmic proof for acyclic digraphs for all...
متن کاملThe CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
Bang-Jensen and Hell conjectured in 1990 (using the language of graph homomorphisms) a CSP dichotomy for digraphs with no sources or sinks. The conjecture states that the constraint satisfaction problem for such a digraph is tractable if each component of its core is a circle and is NP-complete otherwise. In this paper we prove this conjecture, and, as a consequence, a conjecture of Bang-Jensen...
متن کاملList Homomorphisms to Reflexive Digraphs
We study list homomorphism problems L-HOM(H) for the class of reflexive digraphs H (digraphs in which each vertex has a loop). These problems have been intensively studied in the case of undirected graphs H, and appear to be more difficult for digraphs. However, it is known that each problem L-HOM(H) is NP-complete or polynomial time solvable. In this paper we focus on reflexive digraphs. We in...
متن کاملConjecture on Hamilton Cycles in Digraphs of Unitary Matrices
We conjecture new sufficient conditions for a digraph to have a Hamilton cycle. In view of applications, the conjecture is of interest in the areas where unitary matrices are of importance including quantum mechanics and quantum computing.
متن کاملProof of Berge's strong path partition conjecture for k=2
Berge’s strong path partition conjecture from 1982 generalizes and extends Dilworth’s theorem and the Greene–Kleitman theorem which are well known for partially ordered sets. The conjecture is known to be true for all digraphs only for k = 1 (by the Gallai–Milgram theorem) and for k ≥ λ (where λ is the cardinality of the longest path in the graph). The attempts made, so far, to prove the conjec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 340 شماره
صفحات -
تاریخ انتشار 2017